Refine your search
Co-Authors
- P Arul Paul Sudhahar
- V. Thamarai
- M. M. Mehra
- Teena Choudhary
- M. S. Giridhar
- Ashwini Jambhalikar
- Gogulapati Supriya
- Gaurav Saxena
- K. V. Shila
- B. Ramesh
- T. K. Pratheek
- Deepak Kumar Sharma
- R. Islam
- P. Selvaraj
- A. Kalpana
- S. Ajith Kumar
- K. V. Sriram
- A. S. Laxmiprasad
- B. Anitha
- Supriya Gogulapati
- S. sujitha
Journals
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
John, J.
- The Forcing Connected Edge Monophonic Number of a Graph
Abstract Views :800 |
PDF Views:2
Authors
Affiliations
1 Alagappa Government Arts College, Karaikudi–630 003, IN
2 Department of Mathematics, Government College of Engineering, Tirunelveli - 627007, IN
1 Alagappa Government Arts College, Karaikudi–630 003, IN
2 Department of Mathematics, Government College of Engineering, Tirunelveli - 627007, IN
Source
Global Journal of Theoretical and Applied Mathematics Sciences, Vol 3, No 1 (2013), Pagination: 53-59Abstract
Let M be a minimum connected edge monophonic set of G. A subset T ⊆ M is called a forcing subset for M if M is the unique minimum connected edge monophonic set containing T. A forcing subset for M of minimum cardinality is a minimum forcing subset of M. The forcing connected edge monophonic number of M, denoted by fm1c(M), is the cardinality of a minimum forcing subset of M. The forcing connected edge monophonic number of G, denoted by fm1c(G), is fm1c(G) = min{fm1c(M)}, where the minimum is taken over all minimum connected edge monophonic set M in G. It is shown that for every integers a and b with a < b, and − 2 − 2 > 0, there exists a connected graph G such that, fm1c(G) = a and m1c(G) = b , where m1c (G) is the connected edge monophonic number of a graph G.Keywords
Monophonic Number, Connected Edge Monophonic Number, Forcing Edge Monophonic Number, Forcing Connected Edge Monophonic NumberReferences
- F. Buckley and F. Harary, Distance in Graphs, Addition- Wesley, Redwood City, CA, 1990.
- Esamel M. paluga, Sergio R. Canoy, Jr. , Monophonic numbers of the join and Composition of connected graphs, Discrete Mathematics 307 (2007) 1146 - 1154.
- J. John and S. Panchali, The upper monophonic number of a graph, International J. math. Combin. 4(2010), 46-52.
- J. John and P. Arul Paul Sudhahar, On the edge monophonic number of a graph, Filomat 26:6(2012)1081-1089.
- J. John, P.Arul Paul Sudhahar and A.Vijayan, The connected monophonic number of a graph, J.Comp. & Math.Sci. Vol.3(2), (2012) 131-136.
- J. John and P. Arul Paul Sudhahar, The forcing edge monophonic number of a graph, SCIENTIA series A : Mathematical Sciences , Vol.23 ( 2012 ) , 87-98
- Mitre C. Dourado, Fabio protti and Jayme. L. Szwarcfiter, Algorithmic Aspects of Monophonic Convexity, Electronic Notes in Discrete Mathematics 30(2008) 177-1822.
- Understanding Conceptual and Administrative Boundaries of Bonded Labour System Abolition Act, 1976
Abstract Views :201 |
PDF Views:0
Authors
J. John
1
Affiliations
1 Centre for Education and Communication, 173-A Khirki Village Malviya Nagar, New Delhi-110017, IN
1 Centre for Education and Communication, 173-A Khirki Village Malviya Nagar, New Delhi-110017, IN
Source
Journal of Indian School of Political Economy, Vol 18, No 4 (2006), Pagination: 669-684Abstract
The Bonded Labour System Abolition Act, 1976, sets the conceptual and administrative boundaries of bonded labour. The Paper looks into how these boundaries were defined, by examining the political economy of the international and the Indian definitions. The Indian definition of bonded labour is drawn from the international definitions of slavery and forced labour, as they evolved in the course of civil society and state interventions against these human rights abuses. While examining the international definitions, this Paper argues that the Atlantic slave trade, colonialism, and the Cold War were the three defining phases of history in the evolution of the concept. The ethical basis of the project against slavery and forced labour comes from the abolitionists. However, all abolitionists were not guided by ethical considerations alone; abolition served the political and economic compulsions of colonial and capitalistic exploitation. The Indian definition of bonded labour, a legislative expression of the constitutional provision against forced labour, was evolved during the Emergency years. Apoliticism and an overbearing administration left an indelible mark on the definition of bonded labour and the implementation procedures for its abolition. The characterisation of bonded labour as a feudal vestige further delimited the boundaries of bonded labour.- Instrument for Lunar Seismic Activity Studies on Chandrayaan-2 Lander
Abstract Views :1933 |
PDF Views:105
Authors
J. John
1,
V. Thamarai
1,
M. M. Mehra
1,
Teena Choudhary
1,
M. S. Giridhar
1,
Ashwini Jambhalikar
1,
Gogulapati Supriya
1,
Gaurav Saxena
1,
K. V. Shila
1,
B. Ramesh
1,
T. K. Pratheek
1,
Deepak Kumar Sharma
1,
R. Islam
1,
P. Selvaraj
1,
A. Kalpana
1,
S. Ajith Kumar
1,
K. V. Sriram
1,
A. S. Laxmiprasad
1
Affiliations
1 Laboratory for Electro-Optics Systems, Indian Space Research Organisation, Peenya 1st Stage, 1st Cross, Bengaluru 560 058, IN
1 Laboratory for Electro-Optics Systems, Indian Space Research Organisation, Peenya 1st Stage, 1st Cross, Bengaluru 560 058, IN
Source
Current Science, Vol 118, No 3 (2020), Pagination: 376-382Abstract
Instrument for Lunar Seismic Activity Studies (ILSA) is a science payload with the objective of studying seismic activities at the landing site of Vikram, the Lander of Chandrayaan-2. ILSA will be deployed to the lunar surface by a specially built mechanism. It is an indigenously developed instrument based on microelectro mechanical systems technology. High sensitivity silicon micro-machined accelerometer is the heart of the instrument that measures ground acceleration due to lunar quakes. The instrument has the capability of resolving acceleration better than 100 nano-g Hz–1/2 up to a range of 0.5 g over bandwidth of 40 Hz. This paper presents the basic concepts in the design, realization, characterization and the performance test results of the space qualified strong motion seismic sensors.Keywords
Lunar Quakes, MEMS, Seismometer, Strong Motion Sensors.References
- Bulow, R. C. et al., New events discovered in the Apollo lunar seismic data. J. Geophys. Res., 2005, 110, E10003.
- Yamada, R., The description of Apollo seismic experiments; www.darts.isas.jaxa.jp/planet.seismology.
- Watters, T. R. et al., Shallow seismic activity and young thrust faults on the Moon. Nature Geosci., 2019, 12, 411–417; https://www.nature.com/articles/s41561-019-0362-2.pdf
- Lognonne, P. et al., SEIS: insight’s seismic experiment for internal structure of mars. Space Sci. Rev., 2019, 215, 12; https:// doi.org/10.1007/s11214-018-0574-6
- Measuring seismic activity on Venus: a real challenge; https://www.seis-insight.eu/en/public-2/planetary-seismology/venus
- Hunter, G. et al., Development of a high temperature Venus seismometer and extreme environment testing chamber. International Workshop on Instrumentation for Planetary Missions, 2012.
- Havskov, J. and Alguacil, G., Instrumentation in Earthquake Seismology, Springer, June 2002; doi:10.1007/978-3-319-21314-9, ISBN 1402029683.
- Kumar, S., Design and Fabrication of Micromcahined Silicon Suspensions, Ph D thesis, Imperial College, London, 2007.
- Kempe, V., Inertial MEMS Principles and Practice, Cambridge University Press.
- Kulah, H. et al., Noise analysis and characterization of a sigmadelta capacitive microaccelerometer. IEEE J. Solid-State Circuits, 2006, 41(2), 352–361.
- John, J. et al., Design and fabrication of silicon micro structure for seismometer, ISSS International Conference on Smart Materials, Structures and Systems, Bengaluru, 2014.
- IEEE standard specification format guide and test procedure for linear single axis nongyroscopic accelerometers IEEE Std 1293, 1998 (R2008).
- Computational Study on Ion Dynamics of Mems Quadrupole Mass Filter
Abstract Views :199 |
PDF Views:0
Authors
B. Anitha
1,
Supriya Gogulapati
1,
Deepak Kumar Sharma
1,
J. John
1,
M. S. Giridhar
1,
Ashwini Jambhalikar
1
Affiliations
1 MEMS Development Division, Laboratory for Electro-Optics Systems (LEOS), ISRO, Bangalore, IN
1 MEMS Development Division, Laboratory for Electro-Optics Systems (LEOS), ISRO, Bangalore, IN
Source
Manufacturing Technology Today, Vol 19, No 10 (2020), Pagination: 20-26Abstract
The paper presents the simulation studies for the design of a miniaturized Quadrupole Mass Filter (QMF) based on silicon micromachining technology. Mass spectrometers operating in the range of 1 to 100 amu with the resolution of 1 amu are very useful for science payloads in space missions. The mass filtering action of ions in a filter of length 30 mm with electrodes of radius 250 μm is simulated by standard tools. The complete transmission of ions is examined for various Mathieu parameters which are used to define the operating potentials at the electrodes. The performance parameters namely resolution, mass range and the required design considerations such as initial ion velocity, DC and RF voltages and RF frequency are obtained through the model and the computational program using Mathematica. For the efficient ion transmission, an electrostatic slit with aperture of radius 70 μm is placed before the MEMS QMF. Further, the effects of quadrupole length, focusing voltage and the aperture size on the transmission probability of ions are analyzed.Keywords
MEMS Technology, Quadrupole Mass Filter, Mathieu Equation, Resolution.- The Connected Edge-To-Vertex Geodetic Number of a Graph
Abstract Views :145 |
PDF Views:0
Authors
J. John
1,
S. sujitha
2
Affiliations
1 Department of Mathematics, Government College of Engineering, Tirunelveli- 627007, IN
2 Department of Mathematics, Holy Cross College (Autonomous), Nagercoil, IN
1 Department of Mathematics, Government College of Engineering, Tirunelveli- 627007, IN
2 Department of Mathematics, Holy Cross College (Autonomous), Nagercoil, IN
Source
The Journal of the Indian Mathematical Society, Vol 90, No 1-2 (2023), Pagination: 1-12Abstract
Let G = (V, E) be a graph. A subset S ⊆ E is called an edge-to-vertex geodetic set of G if every vertex of G is either incident with an edge of S or lies on a geodesic joining a pair of edges of S. The minimum cardinality of an edge-to-vertex geodetic set of G is gev(G). Any edge-to-vertex geodetic set of cardinality gev(G) is called an edge-to-vertex geodetic basis of G. A connected edge-to-vertex geodetic set of a graph G is an edge-to-vertex geodetic set S such that the subgraph G[S] induced by S is connected. The minimum cardinality of a connected edge-to-vertex geodetic set of G is the connected edge-to-vertex geodetic number of G and is denoted by gcev(G). Some general properties satisfied by this concept are studied. The connected graphs G of size q with connected edge-to-vertex geodetic number 2 or q or q − 1 are characterized. It is shown that for any three positive integers q, a and b with 2 ≤ a ≤ b ≤ q, there exists a connected graph G of size q, gev(G) = a and gcev(G) = b.Keywords
Geodesic, Edge-To-Vertex Godetic Number, Connected Edge-To-Vertex Geodetic Number.References
- F. Buckley and F. Harary, Distance in Graphs, Addison-Wesley, Redwood City, CA, 1990.
- F. Buckley, F. Harary and L. V. Quintas, Extremal results on the Geodetic number of a graph, Scientia A 2, (1988) 17–22.
- G. Chartrand, F. Harary and P. Zhang, Geodetic sets in Graphs , Discuss. Math. Graph Theory, 20 (2000), 129–138.
- G. Chartrand, F. Harary, P.Zhang, On the geodetic number of a graph, Networks, 39(1) (2002), 1–6.
- F. Harary, Graph Theory, Addison-Wesley, 1969.
- D. A. Mojdeh and N. J. Rad, Connected geodomination in graphs, J. Discrete Math. Sci. Cryptogr., 9(1) (2006), 177–186.
- A. P. Santhakumaran P. Titus and J. John, On the connected geodetic number of a Graph, J. Comb. Maths. Comb. Comput, 69 (2009), 219–229.
- A. P. Santhakumaran P. Titus and J. John, The upper connected geodetic number and the forcing connected geodetic number of a Graph, Discrete Appl. Math., 157(7) (2009), 1571–1580.
- A. P. Santhakumaran and J. John, On the edge-to-vertex geodetic number of a graph, Miskolc Math. Notes, 13(1) (2012), 131-141.